Papers with Attention mechanism

6 papers
Denoising Attention for Query-aware User Modeling (2024.findings-naacl)

Copied to clipboard

Challenge: Recent work has proposed to build user models at query time by leveraging the Attention mechanism, which allows weighing the contribution of the user-related information w.r.t. the current query.
Approach: They propose to use the Attention mechanism to build user models at query time by weighing the contribution of the user-related information w.r.t. the Attention variant adopts a robust normalization scheme and introduces . filtering mechanism to better discern among the user related data those helpful for personalization.
Outcome: The proposed approach improves MAP, MRR, and NDCG above 15% w.r.t. other Attention variants at the state-of-the-art.
Multi-Level Structured Self-Attentions for Distantly Supervised Relation Extraction (D18-1)

Copied to clipboard

Challenge: Existing approaches to label large-scale data are inadequate for distantly supervised relation extraction (DS-RE).
Approach: They propose a multi-level structured (2-D matrix) self-attention mechanism for DS-RE using bidirectional recurrent neural networks.
Outcome: The proposed framework significantly outperforms baselines on two publicly available DS-RE datasets in terms of PR curves, P@N and F1 measures.
Understanding Attention for Vision-and-Language Tasks (2022.coling-1)

Copied to clipboard

Challenge: Attention mechanism has been used in Vision-and-Language (VL) tasks to bridge the semantic gap between visual and textual clues.
Approach: They conduct a comprehensive analysis on understanding the role of attention alignment by looking into attention score calculation methods and checking how it represents the visual region’s and textual token’s significance for the global assessment.
Outcome: The attention score calculation methods represent visual region’s and textual token’s significance for the global assessment.
Attention Mechanism with Energy-Friendly Operations (2022.findings-acl)

Copied to clipboard

Challenge: Empirical results show that attention mechanism can be improved from the energy consumption aspects.
Approach: They propose to replace multiplications with either selective operations or additions to reduce energy consumption.
Outcome: The proposed model achieves competitable accuracy while saving 99% and 66% energy during alignment calculation and the whole attention procedure.
Phrase-level Self-Attention Networks for Universal Sentence Encoding (D18-1)

Copied to clipboard

Challenge: Phrase-level self-attention networks (PSAN) can capture context dependencies at the phrase level instead of the sentence level.
Approach: They propose to perform self-attention across words inside a phrase to capture context dependencies at the phrase level and use the gated memory updating mechanism to refine each word’s representation hierarchically with longer-term context dependency captured in a larger phrase.
Outcome: The proposed model can achieve state-of-the-art performance across a plethora of NLP tasks including binary and multi-class classification, natural language inference and sentence similarity.
Adapt Once, Thrive with Updates: Transferable Parameter-Efficient Fine-Tuning on Evolving Base Models (2025.acl-long)

Copied to clipboard

Challenge: Parameter-efficient fine-tuning (PEFT) is a common method for fine- tuning large language models . however, once updated, PEFT modules suffer performance degradation on newer versions .
Approach: They propose a method that enhances the PEFT module by focusing on the task-specific pattern while reducing its dependence on certain knowledge in the base model.
Outcome: Experiments show that PEFT modules can maintain performance on updated models without re-tuning . the proposed approach can be used in real-world applications with large model sizes .

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations